The explicit molecular expansion of the combinatorial logarithm

نویسنده

  • Gilbert Labelle
چکیده

Just as the power series of log(1+X) is the analytical substitutional inverse of the series of exp(X)−1, the (virtual) combinatorial species, Lg(1 +X), is the combinatorial substitutional inverse of the combinatorial species, E(X) − 1, of non-empty finite sets. This combinatorial logarithm, Lg(1 +X), has been introduced by A. Joyal in 1986 by making use of an iterative scheme. Given a species F (X) (with F (0) = 1), one of its main applications is to express the species, F (X), of connected F -structures through the formula F c = Lg(F ) = Lg(1 + F+) where F+ denotes the species of non-empty F -structures. Since its creation, equivalent descriptions of the combinatorial logarithm have been given by other combinatorialists (G. L., I. Gessel, J. Li), but its exact decomposition into irreducible components (molecular expansion) remained unclear. The main goal of the present work is to fill this gap by computing explicitly the molecular expansion of the combinatorial logarithm and of −Lg(1−X), a “ cousin ” of the tensorial species, Lie(X), of free Lie algebras. Résumé. Tout comme la série de puissances de log(1 + X) est l’inverse substitutionnel analytique de la série de exp(X) − 1, l’espèce de structures (virtuelle) Lg(1 + X), est l’inverse substitutionnel combinatoire de l’espèce, E(X)−1, des ensembles finis non vides. Ce logarithme combinatoire, Lg(1+X), a été introduit par A. Joyal en 1986 en faisant appel à un schéma itératif. Étant donnée une espèce F (X) (telle que F (0) = 1), l’une de ses principales applications est d’exprimer l’espèce, F (X), des F -structures connexes par la formule F c = Lg(F ) = Lg(1 + F+) où F+ désigne l’espèce des F -structures non vides. Depuis sa création, des descriptions équivalentes du logarithme combinatoire ont été formulées par d’autres combinatoriciens (G. L., I, Gessel, J. Li), mais sa décomposition exacte en composantes irréductibles (développement moléculaire) est demeurée obscure. Le but principal du présent travail est de combler cette lacune en calculant explicitement le développement moléculaire du logarithme combinatoire et de −Lg(1−X), un “ cousin ” de l’espèce tensorielle, Lie(X), des algèbres de Lie libres.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some combinatorial aspects of finite Hamiltonian groups

In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...

متن کامل

Recurrences and explicit formulae for the expansion and connection coefficients in series of the product of two classical discrete orthogonal polynomials

Suppose that for an arbitrary function $f(x,y)$ of two discrete variables, we have the formal expansions. [f(x,y)=sumlimits_{m,n=0}^{infty }a_{m,n},P_{m}(x)P_{n}(y),] $$‎ ‎x^{m}P_{j}(x)=sumlimits_{n=0}^{2m}a_{m,,n}(j)P_{j+m-n}(x)‎,$$ ‎we find the coefficients $b_{i,j}^{(p,q,ell‎ ,‎,r)}$ in the expansion‎ $$‎ ‎x^{ell }y^{r},nabla _{x}^{p}nabla _{y}^{q},f(x,y)=x^{ell‎ ‎}y^{r}f^{(p,q)}(x,y) =sumli...

متن کامل

Distribution Network Expansion Using Hybrid SA/TS Algorithm

Optimal expansion of medium-voltage power networks is a common issue in electrical distribution planning. Minimizing total cost of the objective function with technical constraints and reliability limits, make it a combinatorial problem which should be solved by optimization algorithms. This paper presents a new hybrid simulated annealing and tabu search algorithm for distribution network expan...

متن کامل

Assessment of "drug-likeness" of a small library of natural products using chemoinformatics

Even though natural products has an excellent record as a source for new drugs, the advent of ultrahigh-throughput screening and large-scale combinatorial synthetic methods, has caused a decline in the use of natural products research in the pharmaceutical industry. This is due to the efficiency in generating and screening a high number of synthetic combinatorial compounds; whereas traditional ...

متن کامل

Information-theoretic approximations of polytopes

Common information was introduced by Wyner [1975] as a measure of dependence of two random variables. This measure has been recently resurrected as a lower bound on the logarithm of the nonnegative rank of a nonnegative matrix in Jain et al. [2013], Braun and Pokutta [2013]. Lower bounds on nonnegative rank have important applications to several areas such as communication complexity and combin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013